Parsing Complementizer Phrases In Machine Translation System

Every language has a finite number of words and finite number of rules but infinite number of sentences. Sentences are not formed by the words alone but by structural units known as constituents. Analysis of the sentence constituency begins at the larger units of grammar and then breaks the larger units down into smaller and smaller units. Syntax is the study of relationships between words and how they are put together to construct phrases and sentences Sentences can also take embedded form that is each sentence consist another sentence with in it. Embedded phrases are complements like NP or PP complements except they are united by the complementizer phrase and may be introduced by a complementizer like subordinate conjunction or a relative pronoun. Paring is the process of identifying the structure of a sentence to know whether a sentence is well formed with respect to a language. It is a process to check whether a sentence can be derived from the given grammar of a language. The two basic approaches for parsing are top-down and bottom-up. This paper describes the process of parsing of complementizer phrases in a machine translation system. Keywords-component Complementizer Phrase (CP), Machine Translation (MT), Government and Binding (GB), Parts of Speech (POS)